1 link tagged with all of: mathematics + complexity analysis
Click any tag below to further narrow down your results
Links
This MIT course focuses on estimating answers and tackling problems through intuitive shortcuts instead of formal proofs or exact calculations. It covers guesswork techniques and heuristic strategies to quickly arrive at useful results.
- MIT's Street Fighting Mathematics (IAP 2008, taught by Scott Aaronson, J. Michael Steele, Steven G. Johnson) teaches estimation and heuristic problem-solving instead of rigorous proofs.
- Key techniques include dimensional analysis, bounding arguments, perturbation methods, and picking simpler functions to bound nasty integrals.
- The course derives results like the √N law for random walks and Stirling's formula through physical intuition and rough approximation rather than formal derivation.
- These heuristics extend beyond physics to algorithm analysis, offering quick mental shortcuts for estimating runtime or complexity (e.g., spotting O(N log N) behavior without formal analysis).
+ street fighting mathematics
+ estimation
+ heuristics
+ dimensional analysis
complexity analysis
mathematics